min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
*(x, 0) → 0
*(x, s(y)) → +(x, *(x, y))
f(s(x)) → f(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
*(x, 0) → 0
*(x, s(y)) → +(x, *(x, y))
f(s(x)) → f(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
*(x, 0) → 0
*(x, s(y)) → +(x, *(x, y))
min(0, y) → 0
f(s(x)) → f(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
*(x, 0) → 0
*(x, s(y)) → +(x, *(x, y))
f(s(x)) → f(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
-1(s(x), s(y)) → -1(x, y)
F(s(x)) → MAX(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))
MIN(s(x), s(y)) → MIN(x, y)
F(s(x)) → -1(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0)))))))
*1(x, s(y)) → *1(x, y)
F(s(x)) → +1(s(x), s(s(s(s(0)))))
F(s(x)) → +1(s(x), s(s(s(0))))
MAX(s(x), s(y)) → MAX(x, y)
+1(s(x), y) → +1(x, y)
F(s(x)) → *1(s(x), s(x))
F(s(x)) → F(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
*1(x, s(y)) → +1(x, *(x, y))
F(s(x)) → MAX(*(s(x), s(x)), +(s(x), s(s(s(0)))))
min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
*(x, 0) → 0
*(x, s(y)) → +(x, *(x, y))
f(s(x)) → f(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
-1(s(x), s(y)) → -1(x, y)
F(s(x)) → MAX(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))
MIN(s(x), s(y)) → MIN(x, y)
F(s(x)) → -1(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0)))))))
*1(x, s(y)) → *1(x, y)
F(s(x)) → +1(s(x), s(s(s(s(0)))))
F(s(x)) → +1(s(x), s(s(s(0))))
MAX(s(x), s(y)) → MAX(x, y)
+1(s(x), y) → +1(x, y)
F(s(x)) → *1(s(x), s(x))
F(s(x)) → F(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
*1(x, s(y)) → +1(x, *(x, y))
F(s(x)) → MAX(*(s(x), s(x)), +(s(x), s(s(s(0)))))
min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
*(x, 0) → 0
*(x, s(y)) → +(x, *(x, y))
f(s(x)) → f(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
-1(s(x), s(y)) → -1(x, y)
min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
*(x, 0) → 0
*(x, s(y)) → +(x, *(x, y))
f(s(x)) → f(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
-1(s(x), s(y)) → -1(x, y)
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
-1(s(x), s(y)) → -1(x, y)
From the DPs we obtained the following set of size-change graphs:
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
+1(s(x), y) → +1(x, y)
min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
*(x, 0) → 0
*(x, s(y)) → +(x, *(x, y))
f(s(x)) → f(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
+1(s(x), y) → +1(x, y)
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
+1(s(x), y) → +1(x, y)
From the DPs we obtained the following set of size-change graphs:
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QDP
↳ QDP
*1(x, s(y)) → *1(x, y)
min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
*(x, 0) → 0
*(x, s(y)) → +(x, *(x, y))
f(s(x)) → f(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDP
↳ QDP
*1(x, s(y)) → *1(x, y)
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
*1(x, s(y)) → *1(x, y)
From the DPs we obtained the following set of size-change graphs:
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QDP
MAX(s(x), s(y)) → MAX(x, y)
min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
*(x, 0) → 0
*(x, s(y)) → +(x, *(x, y))
f(s(x)) → f(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDP
MAX(s(x), s(y)) → MAX(x, y)
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
MAX(s(x), s(y)) → MAX(x, y)
From the DPs we obtained the following set of size-change graphs:
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
F(s(x)) → F(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
*(x, 0) → 0
*(x, s(y)) → +(x, *(x, y))
f(s(x)) → f(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
F(s(x)) → F(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
f(s(x0))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
F(s(x)) → F(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(x)) → F(-(max(+(s(x), *(s(x), x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(x)) → F(-(max(+(s(x), *(s(x), x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(x)) → F(-(max(s(+(x, *(s(x), x))), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(x)) → F(-(max(s(+(x, *(s(x), x))), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(x)) → F(-(max(s(+(x, *(s(x), x))), s(+(x, s(s(s(0)))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(x)) → F(-(max(s(+(x, *(s(x), x))), s(+(x, s(s(s(0)))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(x)) → F(-(s(max(+(x, *(s(x), x)), +(x, s(s(s(0)))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(x)) → F(-(s(max(+(x, *(s(x), x)), +(x, s(s(s(0)))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(x)) → F(-(s(max(+(x, *(s(x), x)), +(x, s(s(s(0)))))), max(s(+(s(x), *(s(x), x))), +(s(x), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(x)) → F(-(s(max(+(x, *(s(x), x)), +(x, s(s(s(0)))))), max(s(+(s(x), *(s(x), x))), +(s(x), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(x)) → F(-(s(max(+(x, *(s(x), x)), +(x, s(s(s(0)))))), max(s(s(+(x, *(s(x), x)))), +(s(x), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(x)) → F(-(s(max(+(x, *(s(x), x)), +(x, s(s(s(0)))))), max(s(s(+(x, *(s(x), x)))), +(s(x), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(x)) → F(-(s(max(+(x, *(s(x), x)), +(x, s(s(s(0)))))), max(s(s(+(x, *(s(x), x)))), s(+(x, s(s(s(s(0)))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(x)) → F(-(s(max(+(x, *(s(x), x)), +(x, s(s(s(0)))))), max(s(s(+(x, *(s(x), x)))), s(+(x, s(s(s(s(0)))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(x)) → F(-(s(max(+(x, *(s(x), x)), +(x, s(s(s(0)))))), s(max(s(+(x, *(s(x), x))), +(x, s(s(s(s(0)))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(x)) → F(-(s(max(+(x, *(s(x), x)), +(x, s(s(s(0)))))), s(max(s(+(x, *(s(x), x))), +(x, s(s(s(s(0)))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(x)) → F(-(max(+(x, *(s(x), x)), +(x, s(s(s(0))))), max(s(+(x, *(s(x), x))), +(x, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
F(s(x)) → F(-(max(+(x, *(s(x), x)), +(x, s(s(s(0))))), max(s(+(x, *(s(x), x))), +(x, s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(max(+(0, 0), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(+(s(x1), *(s(s(x1)), s(x1))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(+(s(x0), *(s(s(x0)), s(x0))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x0))) → F(-(max(+(s(x0), *(s(s(x0)), s(x0))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(max(+(0, 0), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(+(s(x1), *(s(s(x1)), s(x1))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(+(s(x0), *(s(s(x0)), s(x0))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x0))) → F(-(max(+(s(x0), *(s(s(x0)), s(x0))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x1))) → F(-(max(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(+(s(x1), *(s(s(x1)), s(x1))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(+(s(x0), *(s(s(x0)), s(x0))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x0))) → F(-(max(+(s(x0), *(s(s(x0)), s(x0))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(+(s(x1), *(s(s(x1)), s(x1))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(+(s(x0), *(s(s(x0)), s(x0))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x0))) → F(-(max(+(s(x0), *(s(s(x0)), s(x0))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(+(s(x1), *(s(s(x1)), s(x1))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(+(s(x0), *(s(s(x0)), s(x0))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x0))) → F(-(max(+(s(x0), *(s(s(x0)), s(x0))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(max(s(+(x1, *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(+(s(x0), *(s(s(x0)), s(x0))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x0))) → F(-(max(+(s(x0), *(s(s(x0)), s(x0))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(+(s(x0), *(s(s(x0)), s(x0))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(max(+(0, *(s(0), 0)), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(max(*(s(0), 0), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(s(max(+(x0, *(s(s(x0)), s(x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, *(s(s(x0)), s(x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, *(s(s(x0)), s(x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(max(*(s(0), 0), s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(max(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(max(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, *(s(s(x0)), s(x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(max(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, *(s(s(x0)), s(x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(max(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, *(s(s(x0)), s(x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(max(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, *(s(s(x0)), s(x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(max(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, *(s(s(x0)), s(x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(max(s(+(x0, s(+(s(x0), *(s(s(x0)), x0))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(max(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(+(s(x0), *(s(s(x0)), x0))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x0))) → F(-(s(max(+(x0, *(s(s(x0)), s(x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(s(max(+(x0, +(s(s(x0)), *(s(s(x0)), x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(max(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(+(s(x0), *(s(s(x0)), x0))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, +(s(s(x0)), *(s(s(x0)), x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(max(0, +(0, s(s(s(0))))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(max(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(+(s(x0), *(s(s(x0)), x0))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, +(s(s(x0)), *(s(s(x0)), x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(+(s(x0), *(s(s(x0)), x0))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, +(s(s(x0)), *(s(s(x0)), x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(s(0))), max(s(*(s(0), 0)), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(s(s(s(0))), max(s(*(s(0), 0)), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(+(s(x0), *(s(s(x0)), x0))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, +(s(s(x0)), *(s(s(x0)), x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(+(s(x0), *(s(s(x0)), x0))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(*(s(0), 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, +(s(s(x0)), *(s(s(x0)), x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(*(s(0), 0)), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(+(s(x0), *(s(s(x0)), x0))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x0))) → F(-(s(max(+(x0, +(s(s(x0)), *(s(s(x0)), x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(+(s(x1), *(s(s(x1)), x1))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(+(s(x0), *(s(s(x0)), x0))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(*(s(0), 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, +(s(s(x0)), *(s(s(x0)), x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(*(s(0), 0)), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, +(s(s(x0)), *(s(s(x0)), x0))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(s(max(+(x0, s(+(s(x0), *(s(s(x0)), x0)))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(+(0, s(s(s(0)))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(s(s(s(0))), max(s(*(s(0), 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, s(+(s(x0), *(s(s(x0)), x0)))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(*(s(0), 0)), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, s(+(s(x0), *(s(s(x0)), x0)))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(s(0))), max(s(0), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(s(s(s(0))), max(s(0), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, s(+(s(x0), *(s(s(x0)), x0)))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, 0)), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, s(+(s(x0), *(s(s(x0)), x0)))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(0), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(s(0))), max(s(0), +(0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(0)) → F(-(s(s(s(0))), max(s(0), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, s(+(s(x0), *(s(s(x0)), x0)))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(s(x1), s(s(s(0))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, s(+(s(x0), *(s(s(x0)), x0)))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(0), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), +(s(x0), s(s(s(0))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(0), +(0, s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, s(+(s(x0), *(s(s(x0)), x0)))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(s(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), +(s(x0), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(+(0, *(s(0), 0))), s(s(s(s(0)))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(0), +(0, s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(s(0))), s(max(+(0, *(s(0), 0)), s(s(s(0)))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(0), +(0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), s(max(+(0, *(s(0), 0)), s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(s(0))), max(s(0), s(s(s(s(0)))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), *(s(s(x1)), s(x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(0), s(s(s(s(0)))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), s(max(+(0, *(s(0), 0)), s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, *(s(s(x1)), s(x1))))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, *(s(s(x1)), s(x1))))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(0), s(s(s(s(0)))))))
F(s(s(x1))) → F(-(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), s(+(x1, s(s(s(0)))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), s(max(+(0, *(s(0), 0)), s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), s(+(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(0), s(s(s(s(0)))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, *(s(s(x1)), s(x1))))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), s(max(+(0, *(s(0), 0)), s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(s(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(s(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, *(s(s(x1)), s(x1))))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), max(s(0), s(s(s(s(0)))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(s(0))), s(max(+(0, *(s(0), 0)), s(s(s(0)))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(0)), max(+(0, *(s(0), 0)), s(s(s(0))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(s(s(s(0))), max(s(0), s(s(s(s(0)))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, *(s(s(x1)), s(x1))))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(0)), max(+(0, *(s(0), 0)), s(s(s(0))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(s(0))), s(max(0, s(s(s(0)))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(s(s(s(0))), s(max(0, s(s(s(0)))))))
F(s(s(x0))) → F(-(s(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, *(s(s(x1)), s(x1))))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(0)), max(+(0, *(s(0), 0)), s(s(s(0))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1))))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(s(s(s(0))), s(max(0, s(s(s(0)))))))
F(s(s(x0))) → F(-(s(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1))))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(+(s(x1), +(s(s(x1)), *(s(s(x1)), x1)))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(0)), max(+(0, *(s(0), 0)), s(s(s(0))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1))))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(s(s(s(0))), s(max(0, s(s(s(0)))))))
F(s(s(x0))) → F(-(s(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0)))))), max(s(+(s(x0), *(s(s(x0)), s(x0)))), s(+(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1))))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(0)), max(+(0, *(s(0), 0)), s(s(s(0))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(s(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0)))))), s(max(+(s(x0), *(s(s(x0)), s(x0))), +(x0, s(s(s(s(0)))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(s(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0)))))), s(max(+(s(x0), *(s(s(x0)), s(x0))), +(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(s(s(s(0))), s(max(0, s(s(s(0)))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1))))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(0)), max(+(0, *(s(0), 0)), s(s(s(0))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(0)), max(*(s(0), 0), s(s(s(0))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(s(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0)))))), s(max(+(s(x0), *(s(s(x0)), s(x0))), +(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(s(s(s(0))), s(max(0, s(s(s(0)))))))
F(s(0)) → F(-(s(s(0)), max(*(s(0), 0), s(s(s(0))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1))))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(0)), max(0, s(s(s(0))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(s(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0)))))), s(max(+(s(x0), *(s(s(x0)), s(x0))), +(x0, s(s(s(s(0)))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, +(s(s(x1)), *(s(s(x1)), x1))))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(0)), max(*(s(0), 0), s(s(s(0))))))
F(s(0)) → F(-(s(s(0)), max(0, s(s(s(0))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(+(s(x1), *(s(s(x1)), x1)))))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(+(s(x1), *(s(s(x1)), x1)))))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(s(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0)))))), s(max(+(s(x0), *(s(s(x0)), s(x0))), +(x0, s(s(s(s(0)))))))))
F(s(0)) → F(-(s(s(0)), max(*(s(0), 0), s(s(s(0))))))
F(s(0)) → F(-(s(s(0)), max(0, s(s(s(0))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(+(s(x0), *(s(s(x0)), s(x0))), +(x0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(+(s(x0), *(s(s(x0)), s(x0))), +(x0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(+(s(x1), *(s(s(x1)), x1)))))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(0)), max(*(s(0), 0), s(s(s(0))))))
F(s(0)) → F(-(s(s(0)), max(0, s(s(s(0))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(0)), max(0, s(s(s(0))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(+(s(x1), *(s(s(x1)), x1)))))), +(s(x1), s(s(s(s(0))))))))
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(+(s(x0), *(s(s(x0)), s(x0))), +(x0, s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(0)), max(0, s(s(s(0))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(s(0)), s(s(s(0)))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(+(s(x0), *(s(s(x0)), s(x0))), +(x0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(+(s(x1), *(s(s(x1)), x1)))))), +(s(x1), s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(0)), s(s(s(0)))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(s(+(x1, *(s(s(x1)), x1))))))), +(s(x1), s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(+(s(x0), *(s(s(x0)), s(x0))), +(x0, s(s(s(s(0))))))))
F(s(0)) → F(-(s(s(0)), s(s(s(0)))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(s(+(x1, *(s(s(x1)), x1))))))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(s(+(x0, *(s(s(x0)), s(x0)))), +(x0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(s(s(0)), s(s(s(0)))))
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(s(+(x0, *(s(s(x0)), s(x0)))), +(x0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(s(+(x1, *(s(s(x1)), x1))))))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(s(0), s(s(0))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(s(0), s(s(0))))
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(s(+(x0, *(s(s(x0)), s(x0)))), +(x0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(s(+(x1, *(s(s(x1)), x1))))))), +(s(x1), s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(s(+(x1, *(s(s(x1)), x1))))))), s(+(x1, s(s(s(s(0)))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(s(0), s(s(0))))
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(s(+(x0, *(s(s(x0)), s(x0)))), +(x0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(s(+(x1, *(s(s(x1)), x1))))))), s(+(x1, s(s(s(s(0)))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(x0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(0)) → F(-(s(0), s(s(0))))
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(x0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(s(+(x1, *(s(s(x1)), x1))))))), s(+(x1, s(s(s(s(0)))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(0)) → F(-(0, s(0)))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ DependencyGraphProof
↳ QDP
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(x0, s(s(s(s(0))))))))
F(s(0)) → F(-(0, s(0)))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(s(+(x1, *(s(s(x1)), x1))))))), s(+(x1, s(s(s(s(0)))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(x0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), max(s(s(+(x1, s(s(+(x1, *(s(s(x1)), x1))))))), s(+(x1, s(s(s(s(0)))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), s(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(x1, s(s(s(s(0)))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), s(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(x1, s(s(s(s(0)))))))))
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(s(+(x0, +(s(s(x0)), *(s(s(x0)), x0)))), +(x0, s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(s(+(x0, s(+(s(x0), *(s(s(x0)), x0))))), +(x0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x1))) → F(-(s(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0)))))), s(max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(x1, s(s(s(s(0)))))))))
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(s(+(x0, s(+(s(x0), *(s(s(x0)), x0))))), +(x0, s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x1))) → F(-(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0))))), max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(x1, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(s(+(x0, s(+(s(x0), *(s(s(x0)), x0))))), +(x0, s(s(s(s(0))))))))
F(s(s(x1))) → F(-(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0))))), max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(x1, s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
F(s(s(x0))) → F(-(max(+(x0, s(s(+(x0, *(s(s(x0)), x0))))), +(x0, s(s(s(0))))), max(s(+(x0, s(s(+(x0, *(s(s(x0)), x0)))))), +(x0, s(s(s(s(0))))))))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ QDP
F(s(s(x1))) → F(-(max(+(x1, s(s(+(x1, *(s(s(x1)), x1))))), +(x1, s(s(s(0))))), max(s(+(x1, s(s(+(x1, *(s(s(x1)), x1)))))), +(x1, s(s(s(s(0))))))))
*(x, s(y)) → +(x, *(x, y))
+(s(x), y) → s(+(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
+(0, y) → y
*(x, 0) → 0
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
↳ QTRS
↳ AAECC Innermost
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
MIN(s(x), s(y)) → MIN(x, y)
min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
*(x, 0) → 0
*(x, s(y)) → +(x, *(x, y))
f(s(x)) → f(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
+(0, x0)
+(s(x0), x1)
-(x0, 0)
-(s(x0), s(x1))
*(x0, 0)
*(x0, s(x1))
f(s(x0))